Categoricity and Scott Families
نویسندگان
چکیده
Effective model theory is an area of logic that analyzes the effective content of the typical notions and results of model theory and universal algebra. Typical notions in model theory and universal algebra are languages and structures, theories and models, models and their submodels, automorphisms and isomorphisms, embeddings and elementary embeddings. In this paper languages, structures, and models are assumed to be countable. There are many ways to introduce considerations of effectiveness into the area of model theory or universal algebra. Here we will briefly explain considerations of effectiveness for theories and their models on the one hand, and for just structures on the other hand. Let us begin by considering effectiveness for theories and their models. From the model theoretic point of view, given a first order theory, one is interested in finding models for the theory with specific algebraic or modeltheoretic properties. In this sense theories are the basic objects in model theory. A natural way of introducing effectiveness is, therefore, to begin by considering decidable theories, i.e. ones whose theorems form a decidable (i.e. computable or recursive) set.
منابع مشابه
Effective categoricity of Abelian p-groups
We investigate effective categoricity of computable Abelian p-groups A. We prove that all computably categorical Abelian p-groups are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. We investigate which computable Abelian p-groups are ∆02 categorical and relatively ∆ 0 2 categorical.
متن کاملEffective categoricity of equivalence structures
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence classes, or A has only finitely many infinite classes, bounded character, and at most one finite k such that there are infinitely many classes of size k. We also prove that all computably categorical structures are rela...
متن کاملComputable Categoricity versus Relative Computable Categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1-decidable computably categorical structure is relatively ∆2-categorical. We study the complexity of various index sets associated with computable categoricity and relative computable categoricity. We also...
متن کاملUniform Procedures in Uncountable Structures
This paper contributes to the general program of extending techniques and ideas of effective algebra to computable metric space theory. It is well-known that relative computable categoricity (to be defined) of a computable algebraic structure is equivalent to having a c.e. Scott family with finitely many parameters (e.g., [1]). The first main result of the paper extends this characterisation to...
متن کاملTorsion-free Abelian Groups with Optimal Scott Families
We prove that for any computable successor ordinal of the form α = δ + 2k (δ limit and k ∈ ω) there exists computable torsion-free abelian group (TFAG) that is relatively ∆α-categorical and not ∆ 0 α−1-categorical. Equivalently, for any such α there exists a computable TFAG whose initial segments are uniformly described by Σα infinitary computable formulae up to automorphism (i.e., has a c.e. u...
متن کاملOn Computable Categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. In particular, we show that every 1-decidable computably categorical structure is relatively ∆2-categorical, but that there is a computably categorical structure that is not even relatively arithmetically categorical. We also...
متن کامل